Formal testing of timed graph transformation systems using metric temporal graph logic

نویسندگان

چکیده

Abstract Embedded real-time systems generate state sequences where time elapses between changes. Ensuring that such adhere to a provided specification of admissible or desired behavior is essential. Formal model-based testing often suitable cost-effective approach. We introduce an extended version the formalism symbolic graphs, which encompasses types as well attributes, for representing states dynamic systems. Relying on this extension we present novel timed graph transformation (TGTSs) supports development at abstract level possible changes and delays are specified by rules. then form metric temporal logic (MTGL) with increased expressiveness improve applicability MTGL generated TGTS. Based operators its built-in binding mechanics, express properties structure attributes graphs occurrence over related their inner structure. provide formal support checking whether single sequence adheres specification. logical foundation, develop framework TGTSs using MTGL. Lastly, apply running example our prototypical implementation in tool AutoGraph .

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Temporal Graph Logic for Verification of Graph Transformation Systems

We extend our approach for verifying properties of graph transformation systems using suitable abstractions. In the original approach properties are specified as formulae of a propositional temporal logic whose atomic predicates are monadic second-order graph formulae. We generalize this aspect by considering more expressive logics, where edge quantifiers and temporal modalities can be interlea...

متن کامل

Reachability Analysis on Timed Graph Transformation Systems

In recent years, software increasingly exhibits self-* properties like selfoptimization or self-healing. Such properties require reconfiguration at runtime in order to react to changing environments or detected defects. A reconfiguration might add or delete components as well as it might change the communication topology of the system. Considering communication protocols between an arbitrary nu...

متن کامل

dynamic coloring of graph

در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...

15 صفحه اول

Integrating the Specification Techniques of Graph Transformation and Temporal Logic

1 I n t r o d u c t i o n The theory of graph transformation basically studies a variety of formalisms which extend the theory of formal languages in order to deal with structures more general than strings, like graphs and maps. A graph t ransformation system allows one to describe finitely a (possibly infinite) collection of graphs, i.e., those which can be obtained f rom a s tar t graph throu...

متن کامل

A Logic for Analyzing Abstractions of Graph Transformation Systems

A technique for approximating the behaviour of graph transformation systems (GTSs) by means of Petri net-like structures has been recently defined in the literature. In this paper we introduce a monadic second-order logic over graphs expressive enough to characterise typical graph properties, and we show how its formulae can be effectively verified. More specifically, we provide an encoding of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal on Software Tools for Technology Transfer

سال: 2021

ISSN: ['1433-2779', '1433-2787']

DOI: https://doi.org/10.1007/s10009-020-00585-w